Shortest Total Path Length Spanning Tree via Wisdom of Artificial Crowds Algorithm
نویسندگان
چکیده
منابع مشابه
Wisdom of the Crowds in Minimum Spanning Tree Problems
The „wisdom of the crowds‟ effect describes the finding that combining responses across a number of individuals in a group leads to aggregate performance that is as good as or better than the performance of the best individuals in the group. Here, we look at the wisdom of the crowds effect in the Minimum Spanning Tree Problem (MSTP). The MSTP is an optimization problem where observers must conn...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملApproximation algorithms for the shortest total path length spanning tree problem
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to nd a spanning tree of the graph such that the total path length summed over all pairs of the vertices is minimized. In this paper, we present several approximation algorithms for this problem. Our algorithms achieve approximation ratios of 2, 15/8, and 3/2 in time O(n + f...
متن کاملApproximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections
We consider a generalization of the uncapacitated facility location problem that occurs in planning of optical access networks in telecommunications. Clients are connected to open facilities via depthbounded trees. The total demand of clients served by a tree must not exceed a given tree capacity. We investigate a framework for combining facility location algorithms with a tree-based clustering...
متن کاملLecture 14 : Minimum Spanning Tree I
Suppose u, v are different currencies, and the exchange rate is C(u, v) (i.e., 1 unit of v is worth C(u, v) units of u). We set the length of the edge as w(u, v) = logC(u, v). We take the log because, in currency exchange, the rates are multiplicative factors, but in shortest path, path length is defined as sum of edge lengths. By this conversion, the length of a path is log of the total exchan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017